A compact FPGA-based montgomery modular multiplier
نویسندگان
چکیده
<span>This paper presents the FPGA-based implementation of compact montgomery modular multiplier (MMM). MMM serves as a building block commonly required in security protocols relying on public key encryption. The proposed design is intended for hardware applications lightweight cryptographic modules that utilized system chip (SoC) and internet things (IoT) devices. modification structure without any multiplication or subtraction processes. main target new enhancing performance reducing area module. operands internal variables circuit optimized to be bounded smallest efficient size minimize critical path delay. was coded VHDL, implemented Virtex-6 FPGA, its analyzed utilizing XILINX ISE tools. Our occupies comparing with other implementations same FPGA type. saves range between 60.0 99.0% resources compared relevant designs.</span>
منابع مشابه
Efficient VLSI Architecture for Montgomery Modular Multiplier
Montgomery modular multiplication is used in cryptographic algorithms and digital signal processing application. The main objective is to reduce the delay and area of the Montgomery multipliers while maintaining low hardware complexity. To speed up, high-speed Montgomery modular multiplication algorithms and hardware architectures employ carry-save addition to avoid the carry propagation at eac...
متن کاملEfficient VLSI Architecture for Montgomery Modular Multiplier
Montgomery modular multiplication is used in cryptographic algorithms and digital signal processing application. The main objective is to reduce the delay and area of the Montgomery multipliers while maintaining low hardware complexity. To speed up, high-speed Montgomery modular multiplication algorithms and hardware architectures employ carry-save addition to avoid the carry propagation at eac...
متن کاملHigh-Speed Montgomery Modular Multiplication Using High-Radix Systolic Multiplier
A new high-radix systolic multiplier architecture is presented for Montgomery modular multiplication. Using a radix 2, an n-bit modular multiplication only takes about n/w+6 cycles. This leads to a competitive ASIC implementation for RSA and Elliptic Curve Cryptography (ECC).
متن کاملFPGA Implementation of Modular Exponentiation Using Single Modular Multiplier
This paper presents the FPGA implementation of Modular Exponentiation (ME), based on Software/Hardware (SW/HW) approach. Indeed, in Rivest, Shamir and Adleman (RSA) cryptosystem, ME which is computed by series of Modular Multiplications (MM’s), is the main function to encrypt and decrypt data. In order to achieve the best trade-off between area, speed and flexibility, we propose in this work an...
متن کاملFPGA Implementation of Modular Exponentiation Using Montgomery Method
The design of public key cryptography hardware is an active area of research because the speed of cryptographical schemes is a serious bottleneck in many applications. A cheap and flexible modular exponentiation hardware accelerator can be achieved using Field Programmable Gate Arrays (FPGA). FPGA design presented in this paper is based on a Montgomery multiplication (MM) [1], and uses a high-t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indonesian Journal of Electrical Engineering and Computer Science
سال: 2021
ISSN: ['2502-4752', '2502-4760']
DOI: https://doi.org/10.11591/ijeecs.v21.i2.pp735-743